Distillation with Sublogarithmic Overhead
نویسندگان
چکیده
منابع مشابه
Magic-state distillation with low overhead
We propose a family of error-detecting stabilizer codes with an encoding rate of 1/3 that permit a transversal implementation of the gate T = exp (−iπZ/8) on all logical qubits. These codes are used to construct protocols for distilling high-quality “magic” states T |+〉 by Clifford group gates and Pauli measurements. The distillation overhead scales asO( log (1/ )), where is the output accuracy...
متن کاملUniversal Emulations with Sublogarithmic Slowdown
The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area w...
متن کاملSublogarithmic Ambiguity
So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f : N → N there is a context-free language L with a divergent inherent ambiguity function g below f . This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context...
متن کاملDistance Estimators with Sublogarithmic Number of Queries
A distance estimator is a code together with a randomized algorithm. The algorithm approximates the distance of any word from the code by making a small number of queries to the word. One such example is the Reed-Muller code equipped with an appropriate algorithm. It has polynomial length, polylogarithmic alphabet size, and polylogarithmic number of queries. In our work we present two results. ...
متن کاملSublogarithmic Searching without Multiplications
We show that a unit-cost RAM with word length w can maintain an ordered set of w-bit integers (or binary strings) under the operations search, insert, delete, nearest neighbour in O(p log n) worst-case time and range queries in O(p log n+size of output) worst-case time. The operations rely on AC 0 instructions only, thereby solving an open problem posed by Fredman and Willard. The data structur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2018
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.120.050504